Redundancy in distributed proofs

Redundancy in Distributed Proofs

Distributed proofs are mechanisms enabling the nodes of a network to collectivity and efficiently check the correctness of Boolean predicates on the structure of the network, or on data-structures distributed over the nodes (e.g., spanning trees or routing tables). We consider mechanisms consisting of two components: a prover assigning a certificate to each node, and a distributed algorithm cal...

A Redundancy Analysis of Sequent Proofs

Modal Proofs As Distributed Programs

We develop a new foundation for distributed programming languages by defining an intuitionistic, modal logic and then interpreting the modal proofs as distributed programs. More specifically, the proof terms for the various modalities have computational interpretations as remote procedure calls, commands to broadcast computations to all nodes in the network, commands to use portable code, and f...

Customizing Distributed Proofs of Authorization

When identity-based authorization becomes difficult due to the scalability requirements and highly dynamic nature of open distributed systems, digitally certifiable attributes can be an effective basis for specifying authorization policies. Before an authorization decision is made in such a system, a client needs to collect a set of credentials to prove that it satisfies the authorization polic...

File Redundancy Issues in Distributed Database Systems

This paper treats the file redundancy issue in distributed database systems asking what is the optimal number of file copies, given the ratio r of the frequencies of query and update requests. To draw a general conclusion applicable to a wide variety of practical distributed database systems, simplified network models are constructed , and optimal number of file copies, as well as their locatio...